Hypergraph Games
ثبت نشده
چکیده
The above is called the “strong” version of the game. In the “weak” version, also called “maker-breaker”, the second player’s aim is not to occupy a winning set but just to prevent the first player from doing so. The interest is both for general theorems about games and also in particular games of interest, like the Hales-Jewett game (multi-dimensional noughts & crosses). Roughly speaking, a fair amount is known for maker-breaker while nothing at all is known for strong games.
منابع مشابه
Extremal Hypergraphs for the Biased Erdős-Selfridge Theorem
A positional game is essentially a generalization of Tic-Tac-Toe played on a hypergraph (V,F). A pivotal result in the study of positional games is the Erdős– Selfridge theorem, which gives a simple criterion for the existence of a Breaker’s winning strategy on a finite hypergraph F . It has been shown that the bound in the Erdős–Selfridge theorem can be tight and that numerous extremal hypergr...
متن کاملApproximate Hypergraph Coloring under Low-discrepancy and Related Promises
A hypergraph is said to be χ-colorable if its vertices can be colored with χ colors so that no hyperedge is monochromatic. 2-colorability is a fundamental property (called Property B) of hypergraphs and is extensively studied in combinatorics. Algorithmically, however, given a 2-colorable k-uniform hypergraph, it is NP-hard to find a 2-coloring miscoloring fewer than a fraction 2−k+1 of hypered...
متن کاملReachability and recurrence in a modular generalization of annihilating random walks (and lights-out games) to hypergraphs
We study a dynamical system motivated by our earlier work [1] on the statistical physics of social balance on graphs [2, 3], that can be viewed as a generalization of annihilating walks along two directions: first, the interaction topology is a hypergraph; second, the “number of particles“ at a vertex of the hypergraph is an element of a finite field Zp of integers modulo p, p ≥ 3. Equivalently...
متن کاملLocally Expanding Hypergraphs and the Unique Games Conjecture
We examine the hardness of approximating constraint satisfaction problems with k-variable constraints, known as k-CSP’s. We are specifically interested in k-CSP’s whose constraints are unique, which means that for any assignment to any k − 1 of the variables, there is a unique assignment to the last variable satisfying the constraint. One fundamental example of these CSP’s is Ek-Lin-p, the prob...
متن کاملMessage Passing Algorithms for Graphical Games
My intention is to better understand message passing methods and algorithms so that I can develop and implement an algorithm to solve for a Nash equilibrium on a hypergraph (a graph in which the edges can contain more than two vertices). Although hypergraphs can be mapped to the space of bipartite graphs (by setting one part of the bipartite graph to be vertices and the other part to be edges i...
متن کاملBerlin-Poznań Seminar on Discrete Mathematics
Małgosia Bednarska-Bzdȩga Degree and Small-graph Avoider-Enforcer games I will talk on two versions of biased Avoider and Enforcer games played on a hypergraph H = (V,E). In the strict Avoider-Enforcer (a : f) game two players, Avoider and Enforcer, claim in turns previously unselected elements of V , until all vertices are occupied. In each turn Avoider selects exactly a elements, and Enforcer...
متن کامل